Dominated and uniformly dominated families of Loeb-measures.
نویسندگان
چکیده
منابع مشابه
A Note on Uniformly Dominated Sets of Summing Operators
for allx ∈X and all T ∈ . Since the appearance of Grothendieck-Pietsch’s domination theorem for p-summing operators, there is a great interest in finding out the structure of uniformly dominated sets. We will denote by p(μ) the set of all operators T ∈ Πp(X,Y) satisfying (1.1) for all x ∈ X. It is easy to prove that p(μ) is absolutely convex, closed, and bounded (for the p-summing norm). In [4]...
متن کاملLIMIT AVERAGE SHADOWING AND DOMINATED SPLITTING
In this paper the notion of limit average shadowing property is introduced for diffeomorphisms on a compact smooth manifold M and a class of diffeomorphisms is given which has the limit average shadowing property, but does not have the shadowing property. Moreover, we prove that for a closed f-invariant set Lambda of a diffeomorphism f, if Lambda is C1-stably limit average shadowing and t...
متن کاملStrong convergence results for fixed points of nearly weak uniformly L-Lipschitzian mappings of I-Dominated mappings
In this paper, we prove strong convergence results for a modified Mann iterative process for a new class of I- nearly weak uniformly L-Lipschitzian mappings in a real Banach space. The class of I-nearly weak uniformly L-Lipschitzian mappings is an interesting generalization of the class of nearly weak uniformly L-Lipschitzian mappings which inturn is a generalization of the class of nearly unif...
متن کاملLocally Well-Dominated and Locally Independent Well-Dominated Graphs
In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irredundance number, the domination number and the independent domination number can be computed in polynomial time within several classes of graphs, e....
متن کاملDominated Colorings of Graphs
In this paper, we introduce and study a new coloring problem of a graph called the dominated coloring. A dominated coloring of a graph G is a proper vertex coloring of G such that each color class is dominated by at least one vertex of G. The minimum number of colors among all dominated colorings is called the dominated chromatic number, denoted by χdom(G). In this paper, we establish the close...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1988
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-12237